Integrated Parametric Graph Closure and Branch-and-Cut Algorithm for Open Pit Mine Scheduling under Uncertainty

Open pit mine production scheduling is a computationally expensive large-scale mixed-integer linear programming problem. This research develops efficient algorithm to solve open problems under uncertain geological parameters. The proposed solution approach for two-stage process. stochastic problem iteratively solved in the first stage after relaxing resource constraints using parametric graph closure algorithm. Finally, branch-and-cut applied respect constraints, which might be violated during of Six small-scale from iron and copper mines were used validate model. results demonstrated that method could significantly improve computational time with reasonable optimality gap (the maximum 4%). In addition, tested industrial-scale data compared its deterministic show net present value model improved by 6%